Classi cation of lower bounds on the minimum distance of cyclic codes

Synopsis: This paper provides a framework of lower bounds on the minimum distance of cyclic codes. Root bounds depends solely on the den-ing set and the length of a cyclic code, and the BCH Bound, the Hartmann-Tzeng Bound, Bound A and several Boston Bounds are sown to belong to this family. Border bounds furthermore depends on the dening set of cyclic subcodes as well. The Schaub Bound, the Singleton Bound and the van Lint-Wilson Bound are shown to belong to this class. Furthermore are the Schaub Bound and Singleton Bound shown to be equivalent and the van Lint-Wilson Bound shown to share the same independece-check procedure with the two others. Rapportens indhold er frit tilgaengeligt, men oentliggørelse (med kildeangivelse) må kun ske efter aftale med forfatterne.